On the Coefficients of the Laplacian Characteristic Polynomial of Trees
نویسندگان
چکیده
k=0 (−1)n−k ck(T ) λk . Then, as well known, c0(T ) = 0 and c1(T ) = n . If T differs from the star (Sn) and the path (Pn), which requires n ≥ 5 , then c2(Sn) < c2(T ) < c2(Pn) and c3(Sn) < c3(T ) < c3(Pn) . If n = 4 , then c3(Sn) = c3(Pn) . AMS Mathematics Subject Classification (2000): 05C05, 05C12, 05C50
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملSIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کاملImmanantal polynomials and the GTS poset on Trees
Csikvári in [10] defined a poset on the set of unlabelled trees with n vertices that we denote in this paper as GTSn. Among other results, he showed that going up on GTSn has the following effect: the coefficients of the characteristic polynomial of the Laplacian LT of T decrease in absolute value. In this paper, we prove the following more general result involving the q-Laplacian matrix of tre...
متن کاملThe Laplacian Polynomial and Kirchhoff Index of the k-th Semi Total Point Graphs
The k-th semi total point graph of a graph G, , is a graph obtained from G by adding k vertices corresponding to each edge and connecting them to the endpoints of edge considered. In this paper, a formula for Laplacian polynomial of in terms of characteristic and Laplacian polynomials of G is computed, where is a connected regular graph.The Kirchhoff index of is also computed.
متن کاملOn the Laplacian Coefficients of Acyclic Graphs
Let G be a graph of order n and let Λ(G, λ) = ∑n k=0(−1)ckλ be the characteristic polynomial of its Laplacian matrix. Zhou and Gutman recently proved that among all trees of order n, the kth coefficient ck is largest when the tree is a path, and is smallest for stars. A new proof and a strengthening of this result is provided. A relation to the Wiener index is discussed.
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کامل